TCP Congestion Window Validation
نویسندگان
چکیده
TCP’s congestion window controls the number of packets a TCP flow may have in the network at any time. However, long periods when the sender is idle or application-limited can lead to the invalidation of the congestion window, in that the congestion window no longer reflects current information about the state of the network. In this paper we propose a simple modification to TCP’s congestion control algorithms to decay the congestion window cwnd after the transition from a sufficiently-long applicationlimited period, while using the slow-start threshold ssthresh to save information about the previous value of the congestion window. An invalid congestion window also results when the congestion window is increased (i.e., in TCP’s slow-start or congestion avoidance phases) during application-limited periods, when the previous value of the congestion window might never have been fully utilized. We propose that the TCP sender should not increase the congestion window when the TCP sender has been application-limited (and therefore has not fully used the current congestion window). This note illustrates these algorithms both with simulations and with experiments from an implementation in FreeBSD.
منابع مشابه
Updating TCP to Support Rate-Limited Traffic
This document provides a mechanism to address issues that arise when TCP is used for traffic that exhibits periods where the sending rate is limited by the application rather than the congestion window. It provides an experimental update to TCP that allows a TCP sender to restart quickly following a rate-limited interval. This method is expected to benefit applications that send rate-limited tr...
متن کاملModeling network coded TCP throughput: a simple model and its validation
We analyze the performance of TCP and TCP with network coding (TCP/NC) in lossy wireless networks. We build upon the simple framework introduced by Padhye et al. and characterize the throughput behavior of classical TCP as well as TCP/NC as a function of erasure rate, roundtrip time, maximum window size, and duration of the connection. Our analytical results show that network coding masks rando...
متن کاملA Window-Based Flow Control Mechanism based on TCP Vegas with Explicit Congestion Notification
A window-based flow control mechanism is a sort of feedback-based congestion control mechanisms, and has been widely used in TCP/IP networks. Recently proposed TCP Vegas is another version of the TCP mechanism and has potential to achieve much better performance than current TCP Tahoe and Reno. In this paper, we focus on a window-based flow control mechanism based on a congestion avoidance mech...
متن کاملSteady State Analysis of Random Early Detection Gateway
In a packet-switched network, a feedback-based congestion control mechanism is essential to provide data transfer services efficiently. Its main objective is to prevent packet losses in the network, and to utilize network resources effectively. The current Internet uses a window-based flow control mechanism in its TCP (Transmission Control Protocol), as the feedback-based congestion control mec...
متن کاملControlling TCP behavior over lossy links
Many previous attempts to improve TCP performance over lossy links especially error discriminators did not propose a comprehensive response in case of non-congestion drops. In this paper we propose a new algorithm to control TCP congestion window reaction to transmission (non-congestion) drops. This algorithm will be the first step for more comprehensive solution. The new algorithm managed to i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- RFC
دوره 2861 شماره
صفحات -
تاریخ انتشار 2000